#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
const int mod=998244353;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],dp[maxn][12];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    for(LL i=1;i<=n;i++) cin>>a[i];
    dp[2][(a[1]+a[2])%10]+=1;
    dp[2][(a[1]*a[2])%10]+=1;
    for(LL i=2;i<=n;i++){
        for(LL j=0;j<10;j++){
            dp[i+1][(a[i+1]+j)%10]=(dp[i][j]+dp[i+1][(a[i+1]+j)%10])%mod;
            dp[i+1][(a[i+1]*j)%10]=(dp[i][j]+dp[i+1][(a[i+1]*j)%10])%mod;
        }
    }
    for(int j=0;j<10;j++){
        cout<<dp[n][j]<<endl;
    }
   	return 0;
}
